A Cartesian Closed Extension of the Category of Locales

We present a Cartesian closed category ELOC of equilocales, which contains the category LOC of locales as a reflective full subcategory. The embedding of LOC into ELOC preserves products and all exponentials of exponentiable locales

Spaces of valuations

Valuations are measure-like functions mapping the open sets of a topological space into positive real numbers. They can be classified according to some additional properties. Some topological spaces are defined whose elements are valuations from various classes. The relationships among these spaces are studied, and universal properties are shown for some of them

Formula layout

Both the quality of the results of TeX`s formula layout algorithm and the complexity of its description in the TeXbook are hard to beat. The algorithm is (verbally) described as an imperative program with very complex control flow and complicated manipulations of the data structures representing formulae. In a forthcoming textbook, we describe TeX`s formula layout algorithm as a functional program transforming mlist-terms into box-terms. This transformation is given in this paper

Verifying non-functional real-time properties by static analysis

International audienceStatic analyzers based on abstract interpretation are tools aiming at the automatic detection of run-time properties by analyzing the source, assembly or binary code of a program. From Airbus' point of view, the first interesting properties covered by static analyzers available on the market, or as prototypes coming from research, are absence of run-time errors, maximum stack usage and Worst-Case Execution Time (WCET). This paper will focus on the two latter

Spaces of valuations

Valuations are measure-like functions mapping the open sets of a topological space into positive real numbers. They can be classified according to some additional properties. Some topological spaces are defined whose elements are valuations from various classes. The relationships among these spaces are studied, and universal properties are shown for some of them

Software Structure and WCET Predictability

Being able to compute worst-case execution time bounds for tasks of an embedded software system with hard real-time constraints is crucial to ensure the correct (timing) behavior of the overall system. Any means to increase the (static) time predictability of the embedded software are of high interest -- especially due to the ever-growing complexity of such software systems. In this paper we study existing coding proposals and guidelines, such as MISRA-C, and investigate whether they simplify static timing analysis. Furthermore, we investigate how additional knowledge, such as design-level information, can further aid in this process

Formula layout

Both the quality of the results of TeX`s formula layout algorithm and the complexity of its description in the TeXbook are hard to beat. The algorithm is (verbally) described as an imperative program with very complex control flow and complicated manipulations of the data structures representing formulae. In a forthcoming textbook, we describe TeX`s formula layout algorithm as a functional program transforming mlist-terms into box-terms. This transformation is given in this paper

Computing the Worst Case Execution Time of an Avionics Program by Abstract Interpretation

This paper presents how the timing analyser aiT is used for computing the Worst-Case Execution Time (WCET) of two safety-critical avionics programs. The aiT tool has been developed by AbsInt GmbH as a static analyser based on Abstract Interpretatio

PROSPECTRA an ESPRIT Project Notes on TRAFOLA, II The Objects of the Transformation Language

This note tries to treat formally several features introduced in the Study Note ′A Proposal for the Syntactic Part of the PROSPECTRA Transformation Language′, referred to as [1] in the sequel. At first we consider values and the operations on them. The term fragments of the study note contained exactly one hole, this will be generalized. Different kinds of syntactic insertion (inserting values into holes of another value) will be introduced, and their algebraic properties will be investigated. At last, we shall consider the number of partitions of a given term into an upper and a lower fragment. At the end of this document, we give a summary of all definitions and theorems contained in it as a quick reference